The Complexity of Graph Contractions
نویسندگان
چکیده
For a fixed pattern graph H, let H-CONTRACTIBILITY denote the problem of decidingwhether a given input graph is contractible to H. We continue a line of research that wasstarted in 1987 by Brouwer & Veldman, and we determine the computational complexity ofH-CONTRACTIBILITY for certain classes of pattern graphs. In particular, we pin-pointthe complexity for all graphs H with five vertices.Interestingly, in all cases that are known to be polynomially solvable, the pattern graphH has a dominating vertex, whereas in all cases that are known to be NP-complete, thepattern graph H does not have a dominating vertex.
منابع مشابه
$G$-asymptotic contractions in metric spaces with a graph and fixed point results
In this paper, we discuss the existence and uniqueness of fixed points for $G$-asymptotic contractions in metric spaces endowed with a graph. The result given here is a new version of Kirk's fixed point theorem for asymptotic contractions in metric spaces endowed with a graph. The given result here is a generalization of fixed point theorem for asymptotic contraction from metric s paces to metr...
متن کاملSome Fixed Point Theorems for Generalized Contractions in Metric Spaces with a Graph
Jachymski [ Proc. Amer. Math. Soc., 136 (2008), 1359-1373] gave modified version of a Banach fixed point theorem on a metric space endowed with a graph. In the present paper, (G, Φ)-graphic contractions have been de ned by using a comparison function and studied the existence of fixed points. Also, Hardy-Rogers G-contraction have been introduced and some fixed point theorems have been proved. S...
متن کاملFixed points for Chatterjea contractions on a metric space with a graph
In this work, we formulate Chatterjea contractions using graphs in metric spaces endowed with a graph and investigate the existence of fixed points for such mappings under two different hypotheses. We also discuss the uniqueness of the fixed point. The given result is a generalization of Chatterjea's fixed point theorem from metric spaces to metric spaces endowed with a graph.
متن کاملFixed points for Banach and Kannan contractions in modular spaces with a graph
In this paper, we discuss the existence and uniqueness of xed points for Banach and Kannancontractions dened on modular spaces endowed with a graph. We do not impose the Δ2-conditionor the Fatou property on the modular spaces to give generalizations of some recent results. Thegiven results play as a modular version of metric xed point results.
متن کاملBest Proximity Point Result for New Type of Contractions in Metric Spaces with a Graph
In this paper, we introduce a new type of graph contraction using a special class of functions and give a best proximity point theorem for this contraction in complete metric spaces endowed with a graph under two different conditions. We then support our main theorem by a non-trivial example and give some consequences of best proximity point of it for usual graphs.
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کامل